Pii: S0360-8352(99)00086-8
نویسنده
چکیده
In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows. Our neighborhood construction focuses on the relationship between route(s) and node(s). Unlike the conventional methods for parallel route construction, we construct mutes in a nested parallel manner to obtain higher solution quality. Computational results for 60 benchmark problems are reported. The results indicate that our approach is highly competitive with all existing heuristics, in particular very promising for solving problems with large size. © 1999 Elsevier Science Ltd. All rights reserved.
منابع مشابه
Production planning to support mixed-model assembly
A mixed-model assembly line is widely used nowadays in industry. Effectively applying mixed-model assembly can result in smooth part usage and balanced workloads on the assembly line. The problem of production planning in terms of scheduling various models on an assembly line over a time horizon is studied here. The problem assumes that each model has a given range of production days within the...
متن کاملComponent based simulation modeling from neutral component libraries
Researchers at the National Institute of Standards and Technology have proposed the development of libraries of formal, neutral models of simulation components. The availability of such libraries would simplify the generation of simulation models, enable reuse of existing models construction of complicated models from simpler ones, and speed Internet-based simulation services. The result would ...
متن کاملPii: S0360-8352(98)00105-3
ÐWe consider the problem of scheduling n identical jobs with unequal ready times on m parallel uniform machines to minimize the maximum lateness. This paper develops a branch-and-bound procedure that optimally solves the problem and introduces six simple single-pass heuristic procedures that approximate the optimal solution. The branch-and-bound procedure uses the heuristics to establish an ini...
متن کاملPii: S0360-8352(98)00110-7
A critical problem in decision analysis is how to evaluate the dierence between two or more dierent rankings of a set of alternatives. In this paper it is assumed that a group of decision makers has already established a ranking for each one of a set of alternatives. Then, the problem examined here is how to evaluate the dierences among these rankings. This problem does not have a unique sol...
متن کاملPii: S0360-8352(02)00181-x
We consider the problem of scheduling a number of jobs on a single machine against a restrictive common due date. The paper consists of two parts: firstly a new and appropriate problem representation is developed. As the restrictive common due date problem is known to be intractable we decided, secondly, to apply meta-heuristics, namely evolutionary strategies, simulated annealing and threshold...
متن کامل